全文获取类型
收费全文 | 13397篇 |
免费 | 1668篇 |
国内免费 | 551篇 |
专业分类
化学 | 2109篇 |
晶体学 | 67篇 |
力学 | 1601篇 |
综合类 | 423篇 |
数学 | 7296篇 |
物理学 | 4120篇 |
出版年
2024年 | 23篇 |
2023年 | 231篇 |
2022年 | 498篇 |
2021年 | 683篇 |
2020年 | 462篇 |
2019年 | 401篇 |
2018年 | 404篇 |
2017年 | 521篇 |
2016年 | 665篇 |
2015年 | 456篇 |
2014年 | 744篇 |
2013年 | 942篇 |
2012年 | 680篇 |
2011年 | 745篇 |
2010年 | 634篇 |
2009年 | 803篇 |
2008年 | 768篇 |
2007年 | 815篇 |
2006年 | 645篇 |
2005年 | 578篇 |
2004年 | 511篇 |
2003年 | 447篇 |
2002年 | 416篇 |
2001年 | 342篇 |
2000年 | 317篇 |
1999年 | 261篇 |
1998年 | 247篇 |
1997年 | 207篇 |
1996年 | 171篇 |
1995年 | 150篇 |
1994年 | 107篇 |
1993年 | 107篇 |
1992年 | 107篇 |
1991年 | 66篇 |
1990年 | 70篇 |
1989年 | 41篇 |
1988年 | 49篇 |
1987年 | 46篇 |
1986年 | 44篇 |
1985年 | 42篇 |
1984年 | 44篇 |
1983年 | 14篇 |
1982年 | 22篇 |
1981年 | 12篇 |
1980年 | 11篇 |
1979年 | 12篇 |
1978年 | 13篇 |
1977年 | 12篇 |
1976年 | 7篇 |
1959年 | 10篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
21.
Summary This paper is concerned with the problem of developing numerical integration algorithms for differential equations that, when
viewed as equations in some Euclidean space, naturally evolve on some embedded submanifold. It is desired to construct algorithms
whose iterates also evolve on the same manifold. These algorithms can therefore be viewed as integrating ordinary differential
equations on manifolds. The basic method “decouples” the computation of flows on the submanifold from the numerical integration
process. It is shown that two classes of single-step and multistep algorithms can be posed and analyzed theoretically, using
the concept of “freezing” the coefficients of differential operators obtained from the defining vector field. Explicit third-order
algorithms are derived, with additional equations augmenting those of their classical counterparts, obtained from “obstructions”
defined by nonvanishing Lie brackets. 相似文献
22.
Jinchao Xu 《应用数学学报(英文版)》2002,18(2):185-200
Abstract Some new local and parallel finite element algorithms are proposed and analyzed in this paper foreigenvalue problems.With these algorithms, the solution of an eigenvalue problem on a fine grid is reduced tothe solution of an eigenvalue problem on a relatively coarse grid together with solutions of some linear algebraicsystems on fine grid by using some local and parallel procedure.A theoretical tool for analyzing these algorithmsis some local error estimate that is also obtained in this paper for finite element approximations of eigenvectorson general shape-regular grids. 相似文献
23.
M. M. Kostreva 《Journal of Optimization Theory and Applications》1989,62(1):63-76
Murty's algorithm for the linear complementarity problem is generalized to solve the optimality conditions for linear and convex quadratic programming problems with both equality and inequality constraints. An implementation is suggested which provides both efficiency and tight error control. Numerical experiments as well as field tests in various applications show favorable results.The author thanks K. G. Murty for his encouragement and helpful comments. 相似文献
24.
R. J. Vanderbei 《Mathematical Programming》1989,43(1-3):31-44
The affine-scaling modification of Karmarkar's algorithm is extended to solve problems with free variables. This extended primal algorithm is used to prove two important results. First the geometrically elegant feasibility algorithm proposed by Chandru and Kochar is the same algorithm as the one obtained by appending a single column of residuals to the constraint matrix. Second the dual algorithm as first described by Adler et al., is the same as the extended primal algorithm applied to the dual. 相似文献
25.
A new family of proximity graphs: Class cover catch digraphs 总被引:1,自引:0,他引:1
Jason DeVinney 《Discrete Applied Mathematics》2006,154(14):1975-1982
Motivated by issues in machine learning and statistical pattern classification, we investigate a class cover problem (CCP) with an associated family of directed graphs—class cover catch digraphs (CCCDs). CCCDs are a special case of catch digraphs. Solving the underlying CCP is equivalent to finding a smallest cardinality dominating set for the associated CCCD, which in turn provides regularization for statistical pattern classification. Some relevant properties of CCCDs are studied and a characterization of a family of CCCDs is given. 相似文献
26.
L. Aggoun 《Mathematical and Computer Modelling》2002,36(11-13)
In this paper, finite-dimensional recursive filters for space-time Markov random fields are derived. These filters can be used with the expectation maximization (EM) algorithm to yield maximum likelihood estimates of the parameters of the model. 相似文献
27.
A simple scheme is developed for treatment of vertical bed topography in shallow water flows. The effect of the vertical step on flows is modelled with the shallow water equations including local energy loss terms. The bed elevation is denoted with zb‐ for the left and zb+ for the right values at each grid point, hence exactly representing a discontinuity in the bed topography. The surface gradient method (SGM) is generalized to reconstruct water depths at cell interfaces involving a vertical step so that the fluxes at the cell interfaces can accurately be calculated with a Riemann solver. The scheme is verified by predicting a surge crossing a step, a tidal flow over a step and dam‐break flows on wet/dry beds. The results have shown good agreements compared with analytical solutions and available experimental data. The scheme is efficient, robust, and may be used for practical flow calculations. Copyright © 2002 John Wiley & Sons, Ltd. 相似文献
28.
Y. Wardi 《Journal of Optimization Theory and Applications》1989,61(3):473-485
A stochastic algorithm for finding stationary points of real-valued functions defined on a Euclidean space is analyzed. It is based on the Robbins-Monro stochastic approximation procedure. Gradient evaluations are done by means of Monte Carlo simulations. At each iteratex
i
, one sample point is drawn from an underlying probability space, based on which the gradient is approximated. The descent direction is against the approximation of the gradient, and the stepsize is 1/i. It is shown that, under broad conditions, w.p.1 if the sequence of iteratesx
1,x
2,...generated by the algorithm is bounded, then all of its accumulation points are stationary. 相似文献
29.
30.
线性分式规划最优解集的求法 总被引:5,自引:0,他引:5
薛声家 《应用数学与计算数学学报》2002,16(1):90-96
本文使用多面集的表示定理,导出了线性分式规划最优解集的结构,并给出确定全部最优解的计算步骤。 相似文献